Error analysis in unconditionally stable coarsening algorithms
نویسنده
چکیده
In order to quantitatively study the accuracy of the unconditionally stable coarsening algorithms, we calculate the Fourier space multi step error on the order parameter field by explicitly distinguishing the analytic time τ and the algorithmic time t. The calculation determines the error in the order parameter and the scaled correlations. This error contributes a correction term in the analytic time step, which is crucial in understanding the accuracy in unconditionally stable coarsening algorithms.
منابع مشابه
Maximally fast coarsening algorithms.
We present maximally fast numerical algorithms for conserved coarsening systems that are stable and accurate with a growing natural time step Deltat=At2/3s. We compare the scaling structure obtained from our maximally fast conserved systems directly against the standard fixed time-step Euler algorithm, and find that the error scales as square root of A--so arbitrary accuracy can be achieved. Fo...
متن کاملFast and accurate coarsening simulation with an unconditionally stable time step.
We present Cahn-Hilliard and Allen-Cahn numerical integration algorithms that are unconditionally stable and so provide significantly faster accuracy-controlled simulation. Our stability analysis is based on Eyre's theorem and unconditional von Neumann stability analysis, both of which we present. Numerical tests confirm the accuracy of the von Neumann approach, which is straightforward and sho...
متن کاملبهبود روش انتگرالگیری دقیق مرتبه اول برای تحلیل دینامیکی سازهها با معکوسسازی ماتریس حالت
For solving the dynamic equilibrium equation of structures, several second-order numerical methods have so far been proposed. In these algorithms, conditional stability, period elongation, amplitude error, appearance of spurious frequencies and dependency of the algorithms to the time steps are the crucial problems. Among the numerical methods, Newmark average acceleration algorithm, regardl...
متن کاملAlgorithms for Area Preserving Flows
We propose efficient and accurate algorithms for computing certain area preserving geometric motions of curves in the plane, such as area preserving motion by curvature. These schemes are based on a new class of diffusion generated motion algorithms using signed distance functions. In particular, they alternate two very simple and fast operations, namely convolution with the Gaussian kernel and...
متن کاملGyroscope Drift Error Analysis in the Position-Independent Navigation Algorithm of a stable platform Inertial System
This paper deals with analyzing gyroscope drift error in the position-independent navigation algorithm of a stable platform inertial system. Most of the stable platform navigation algorithms proposed in the literature have drawbacks of estimating position rates for alignment commands. Not only the estimating position rates are the basic source of position errors, but they also make the alignmen...
متن کامل